Constructive Mathematical Truth
نویسنده
چکیده
We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithmetical statements is Π 2 and Σ 2 hard, and we conjecture it to be complete for second order arithmetic. A statement is constructively true iff it is realized by a constructive function under continuous function realizability.
منابع مشابه
The Trilattice of Constructive Truth Values
We introduce an abstract algebraic structure — a lattice defined on a generalized truth value space of constructive logic. For background one can refer to the idea of ‘under-determined’ and ‘over-determined’ valuations (Dunn), a ‘useful four-valued logic’ (Belnap), and the notion of a bilattice (Ginsberg). We consider within one general framework the notions of constructive truth and constructi...
متن کاملPoetry of a Logical Truth
We evoke some poetical aspects of a new kind of logical truth (an inner quantum truth) embodying both physical and mathematical concepts, which can be viewed at the same time as a constructive mathematical object, as well as a pure platonic idea.
متن کاملDual Intuitionistic
We consider a logic which is semantically dual (in some precise sense of the term) to intuitionistic. This logic can be labeled as “falsification logic”: it embodies the Popperian methodology of scientific discovery. Whereas intuitionistic logic deals with constructive truth and non-constructive falsity, and Nelson’s logic takes both truth and falsity as constructive notions, in the falsificati...
متن کاملIntuitionistic Mathematics and Realizability in the Physical World
Intuitionistic mathematics perceives subtle variations in meaning where classical mathematics asserts equivalence, and permits geometrically and computationally motivated axioms that classical mathematics prohibits. It is therefore wellsuited as a logical foundation on which questions about computability in the real world are studied. The realizability interpretation explains the computational ...
متن کاملConstructive Dimension and Weak Truth-Table Degrees
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff dimension dimH(S) and constructive packing dimension dimP(S) is weak truth-table equivalent to a sequence R with dimH(R) ≥ dimH(S)/dimP(S)− ǫ, for arbitrary ǫ > 0. Furthermore, if dimP(S) > 0, then dimP(R) ≥ 1− ǫ. The re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006